Has Quantum cryptography been proven secure?
نویسندگان
چکیده
Quantum cryptography asserts that shared secrets can be established over public channels in such a way that the total information of an eavesdropper can be made arbitrarily small with probability arbitrarily close to 1. As we will show below, the current state of affairs, especially as it pertains to engineering issues, leaves something to be desired. keywords: Quantum cryptography, Reconciliation, Privacy amplification, BB84, Rényi Entropy
منابع مشابه
An unbreakable cryptosystem
The remarkably long-standing problem of cryptography is to generate completely secure key. It is widely believed that the task cannot be achieved within classical cryptography. However, there is no proof in support of this belief. We present an incredibly simple classical cryptosystem which can generate completely secure key. Cryptography is an ancient art [1]. However, in the last century cryp...
متن کاملEfficient Simulation for Quantum Message Authentication
A mix of physics, mathematics, and computer science, the study of quantum information seeks to understand and utilize the information that can be held in the state of a quantum system. Quantum cryptography is then the study of various cryptographic protocols on the information in a quantum system. One of the goals we may have is to verify the integrity of quantum data, a process called quantum ...
متن کاملQuantum Computers Render Quantum Key Distribution Unconditionally Secure Over Arbitrarily Long Distances
Quantum cryptography has long been claimed to be useful for achieving many tasks that are impossible from the perspective of conventional cryptography. Arguably, the most important problem in quantum cryptography has been a rigorous proof of the security of quantum key distribution, the most well-known application. This notoriously hard problem has eluded researchers for years and has become ev...
متن کامل2 2 M ay 1 99 8 Quantum Computers Render Quantum Key Distribution Unconditionally Secure
Quantum cryptography has long been claimed to be useful for achieving many tasks that are impossible from the perspective of conventional cryptography. Arguably, the most important problem in quantum cryptography has been a rigorous proof of the security of quantum key distribution, the most wellknown application. This notoriously hard problem has eluded researchers for the last fifteen years a...
متن کاملRandom Oracles in a Quantum World
The interest in post-quantum cryptography — classical systems that remain secure in the presence of a quantum adversary — has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and are proven secure relative to adversaries that have classical access to the random oracle. We argue that to prove post-quantum security one needs to prove secu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006